A tight bound for approximating the square root
نویسندگان
چکیده
منابع مشابه
A Tight Bound for Approximating the Square Root
We prove an (loglog(1=")) lower bound on the depth of any computation tree and
متن کاملA Tight Bound for EMAC
We prove a new upper bound on the advantage of any adversary for distinguishing the encrypted CBC-MAC (EMAC) based on random permutations from a random function. Our proof uses techniques recently introduced in [BPR05], which again were inspired by [DGH04]. The bound we prove is tight — in the sense that it matches the advantage of known attacks up to a constant factor — for a wide range of the...
متن کاملA Tight Bound for the Lamplighter Problem
We settle an open problem, raised by Y. Peres and D. Revelle, concerning the L mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation distance of the chain, and show that the lamplighter graphs once again provide examples of tightness of our results.
متن کاملTight Bound for Matching1
Matching is an extensively studied topic. The question we want to study here is the lower bound of a maximum matching in a graph. Earlier researchers studied the problem of the existence of a perfect matching (i.e. a matching of size n/2 with n vertices in a graph). Petersen [7] showed that a bridgeless cubic graph has a perfect matching. König [4] showed that there exists a perfect matching in...
متن کاملOn the square root of quadratic matrices
Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1997
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00126-9